./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 32bit --witnessprinter.graph.data.programhash 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:58:31,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:58:31,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 14:58:31,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:58:31,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:58:31,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:58:31,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:58:31,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:58:31,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:58:31,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:58:31,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:58:31,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:58:31,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:58:31,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:58:31,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:58:31,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:58:31,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:58:31,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:58:31,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:58:31,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:58:31,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:58:31,917 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:58:31,917 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 14:58:31,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:58:31,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:58:31,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:58:31,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:58:31,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:58:31,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:58:31,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:58:31,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:58:31,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:58:31,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:58:31,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:58:31,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:58:31,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:58:31,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:58:31,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:58:31,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:58:31,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:58:31,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:58:31,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:58:31,922 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 [2024-11-10 14:58:32,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:58:32,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:58:32,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:58:32,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:58:32,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:58:32,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-11-10 14:58:33,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:58:33,652 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:58:33,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-11-10 14:58:33,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c5f5656/9d3bae2ff10b45ac901d62aef8bbce4b/FLAG256aa97a8 [2024-11-10 14:58:34,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c5f5656/9d3bae2ff10b45ac901d62aef8bbce4b [2024-11-10 14:58:34,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:58:34,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:58:34,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:58:34,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:58:34,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:58:34,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b78034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34, skipping insertion in model container [2024-11-10 14:58:34,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:58:34,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:58:34,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:58:34,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:58:34,453 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:58:34,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34 WrapperNode [2024-11-10 14:58:34,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:58:34,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:58:34,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:58:34,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:58:34,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,484 INFO L138 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-10 14:58:34,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:58:34,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:58:34,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:58:34,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:58:34,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,511 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 14:58:34,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:58:34,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:58:34,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:58:34,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:58:34,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (1/1) ... [2024-11-10 14:58:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:58:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:34,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:58:34,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:58:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 14:58:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 14:58:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:58:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:58:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:58:34,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:58:34,711 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:58:34,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:58:34,864 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2024-11-10 14:58:34,873 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-10 14:58:34,873 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:58:34,883 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:58:34,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:58:34,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:34 BoogieIcfgContainer [2024-11-10 14:58:34,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:58:34,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:58:34,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:58:34,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:58:34,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:58:34" (1/3) ... [2024-11-10 14:58:34,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f5e53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:58:34, skipping insertion in model container [2024-11-10 14:58:34,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:34" (2/3) ... [2024-11-10 14:58:34,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f5e53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:58:34, skipping insertion in model container [2024-11-10 14:58:34,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:34" (3/3) ... [2024-11-10 14:58:34,891 INFO L112 eAbstractionObserver]: Analyzing ICFG count_down-alloca-1.i [2024-11-10 14:58:34,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:58:34,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-10 14:58:34,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:58:34,944 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;@2e08da95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:58:34,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-10 14:58:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 14:58:34,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:34,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:34,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:34,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -596087286, now seen corresponding path program 1 times [2024-11-10 14:58:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009752864] [2024-11-10 14:58:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009752864] [2024-11-10 14:58:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009752864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:35,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:58:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705277130] [2024-11-10 14:58:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:58:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:58:35,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:35,180 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 35 states have internal predecessors, (44), 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, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:35,233 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-10 14:58:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:58:35,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 14:58:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:35,264 INFO L225 Difference]: With dead ends: 36 [2024-11-10 14:58:35,264 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 14:58:35,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:35,271 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:35,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 14:58:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 14:58:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 32 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-11-10 14:58:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-10 14:58:35,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 7 [2024-11-10 14:58:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:35,301 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-10 14:58:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-10 14:58:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 14:58:35,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:35,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:35,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:58:35,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1606307094, now seen corresponding path program 1 times [2024-11-10 14:58:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374286191] [2024-11-10 14:58:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374286191] [2024-11-10 14:58:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374286191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:35,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:58:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654979162] [2024-11-10 14:58:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:35,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:58:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:58:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:35,372 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:35,395 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-10 14:58:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:58:35,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-10 14:58:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:35,396 INFO L225 Difference]: With dead ends: 29 [2024-11-10 14:58:35,396 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 14:58:35,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:35,397 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:35,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 14:58:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-10 14:58:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 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-11-10 14:58:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-10 14:58:35,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 9 [2024-11-10 14:58:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-10 14:58:35,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-10 14:58:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 14:58:35,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:35,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:35,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:58:35,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1606307093, now seen corresponding path program 1 times [2024-11-10 14:58:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429181081] [2024-11-10 14:58:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429181081] [2024-11-10 14:58:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429181081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:58:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661407319] [2024-11-10 14:58:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:58:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:58:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:58:35,664 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:35,818 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-10 14:58:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-11-10 14:58:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:35,820 INFO L225 Difference]: With dead ends: 56 [2024-11-10 14:58:35,821 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 14:58:35,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:58:35,823 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:35,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 107 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 14:58:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2024-11-10 14:58:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-10 14:58:35,832 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 9 [2024-11-10 14:58:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:35,832 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-10 14:58:35,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-10 14:58:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 14:58:35,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:35,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:35,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:58:35,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -718803412, now seen corresponding path program 1 times [2024-11-10 14:58:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:35,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412449196] [2024-11-10 14:58:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412449196] [2024-11-10 14:58:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412449196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:36,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:58:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464877424] [2024-11-10 14:58:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:36,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:58:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:58:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:36,081 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:36,185 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-10 14:58:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:58:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 9 [2024-11-10 14:58:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:36,186 INFO L225 Difference]: With dead ends: 40 [2024-11-10 14:58:36,186 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 14:58:36,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 14:58:36,187 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:36,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 14:58:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-11-10 14:58:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-10 14:58:36,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2024-11-10 14:58:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:36,191 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-10 14:58:36,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-10 14:58:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 14:58:36,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:36,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:58:36,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1372381743, now seen corresponding path program 1 times [2024-11-10 14:58:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301659055] [2024-11-10 14:58:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301659055] [2024-11-10 14:58:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301659055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440157508] [2024-11-10 14:58:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:36,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:36,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:36,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:36,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:58:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:36,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:58:36,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:36,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:58:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440157508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:58:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 14:58:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783018105] [2024-11-10 14:58:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:58:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:58:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:36,371 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:36,388 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-10 14:58:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-10 14:58:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:36,389 INFO L225 Difference]: With dead ends: 56 [2024-11-10 14:58:36,390 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 14:58:36,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:36,391 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:36,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 14:58:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-11-10 14:58:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-10 14:58:36,395 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 14 [2024-11-10 14:58:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:36,395 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-10 14:58:36,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-10 14:58:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 14:58:36,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:36,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:36,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:58:36,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:36,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1243299024, now seen corresponding path program 1 times [2024-11-10 14:58:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760529380] [2024-11-10 14:58:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760529380] [2024-11-10 14:58:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760529380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389237117] [2024-11-10 14:58:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:36,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:36,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:36,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:58:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:36,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 14:58:36,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:36,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-10 14:58:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:37,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:58:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389237117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:58:37,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:58:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2024-11-10 14:58:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255609625] [2024-11-10 14:58:37,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:58:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 14:58:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 14:58:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-10 14:58:37,613 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:38,016 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-10 14:58:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:58:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-10 14:58:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:38,021 INFO L225 Difference]: With dead ends: 47 [2024-11-10 14:58:38,021 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 14:58:38,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2024-11-10 14:58:38,022 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 108 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:38,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 112 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:58:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 14:58:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-11-10 14:58:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-10 14:58:38,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2024-11-10 14:58:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:38,032 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-10 14:58:38,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-10 14:58:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 14:58:38,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:38,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:38,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:58:38,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 14:58:38,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -892846007, now seen corresponding path program 1 times [2024-11-10 14:58:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729539804] [2024-11-10 14:58:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729539804] [2024-11-10 14:58:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729539804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115111803] [2024-11-10 14:58:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:38,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:38,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:58:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:38,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:58:38,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:38,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:58:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-10 14:58:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115111803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:58:38,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:58:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 14:58:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601732218] [2024-11-10 14:58:38,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:58:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:58:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:58:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:58:38,736 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:38,814 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-10 14:58:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:58:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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 17 [2024-11-10 14:58:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:38,815 INFO L225 Difference]: With dead ends: 52 [2024-11-10 14:58:38,815 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 14:58:38,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:58:38,816 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 109 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:38,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 94 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 14:58:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2024-11-10 14:58:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 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-11-10 14:58:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-10 14:58:38,819 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 17 [2024-11-10 14:58:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:38,819 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 14:58:38,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-10 14:58:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 14:58:38,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:38,820 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:38,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:58:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:39,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1908467172, now seen corresponding path program 1 times [2024-11-10 14:58:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835636832] [2024-11-10 14:58:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:58:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:39,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835636832] [2024-11-10 14:58:39,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835636832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:39,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:58:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015476566] [2024-11-10 14:58:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:39,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:58:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:58:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:39,053 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:39,071 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-10 14:58:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:58:39,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 18 [2024-11-10 14:58:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:39,072 INFO L225 Difference]: With dead ends: 49 [2024-11-10 14:58:39,072 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 14:58:39,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:39,073 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:39,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 14:58:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-11-10 14:58:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-10 14:58:39,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2024-11-10 14:58:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-10 14:58:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-10 14:58:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 14:58:39,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:39,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:39,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:58:39,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:39,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash -349268100, now seen corresponding path program 1 times [2024-11-10 14:58:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569736319] [2024-11-10 14:58:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:58:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569736319] [2024-11-10 14:58:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569736319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102440985] [2024-11-10 14:58:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:39,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:39,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 14:58:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:58:39,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:58:39,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:58:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102440985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:39,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:58:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 14:58:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785934296] [2024-11-10 14:58:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:58:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:39,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:58:39,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:39,190 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:39,215 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-10 14:58:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-10 14:58:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:39,216 INFO L225 Difference]: With dead ends: 54 [2024-11-10 14:58:39,216 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 14:58:39,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:39,216 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:39,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 14:58:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 14:58:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-10 14:58:39,220 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 23 [2024-11-10 14:58:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:39,220 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-10 14:58:39,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-10 14:58:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 14:58:39,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:39,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:39,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:58:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:39,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash -137917187, now seen corresponding path program 1 times [2024-11-10 14:58:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387715773] [2024-11-10 14:58:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387715773] [2024-11-10 14:58:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387715773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029026010] [2024-11-10 14:58:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:39,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:39,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:39,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 14:58:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 14:58:39,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:39,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:58:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029026010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:58:39,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:58:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-10 14:58:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055985426] [2024-11-10 14:58:39,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:58:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:58:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:58:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:58:39,587 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:39,645 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-10 14:58:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:58:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 23 [2024-11-10 14:58:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:39,646 INFO L225 Difference]: With dead ends: 75 [2024-11-10 14:58:39,646 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 14:58:39,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 14:58:39,647 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:39,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 14:58:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2024-11-10 14:58:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-11-10 14:58:39,653 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 23 [2024-11-10 14:58:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:39,654 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-11-10 14:58:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-10 14:58:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 14:58:39,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:39,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:39,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 14:58:39,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 14:58:39,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:39,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2057546057, now seen corresponding path program 1 times [2024-11-10 14:58:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167885110] [2024-11-10 14:58:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:58:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167885110] [2024-11-10 14:58:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167885110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:58:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714259243] [2024-11-10 14:58:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:39,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:58:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:58:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:39,979 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:39,993 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-10 14:58:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:58:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 14:58:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:39,994 INFO L225 Difference]: With dead ends: 58 [2024-11-10 14:58:39,994 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 14:58:39,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:39,995 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:39,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 14:58:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 14:58:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-11-10 14:58:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-10 14:58:39,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2024-11-10 14:58:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:39,999 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-10 14:58:39,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-10 14:58:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 14:58:40,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:40,001 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:58:40,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-10 14:58:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -698791167, now seen corresponding path program 2 times [2024-11-10 14:58:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234012499] [2024-11-10 14:58:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234012499] [2024-11-10 14:58:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234012499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421803077] [2024-11-10 14:58:40,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:58:40,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:40,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:40,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 14:58:40,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:58:40,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:58:40,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 14:58:40,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:40,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 14:58:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 14:58:40,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:58:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 14:58:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421803077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:58:40,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:58:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-10 14:58:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184183134] [2024-11-10 14:58:40,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:58:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 14:58:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 14:58:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-10 14:58:40,769 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:40,949 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-10 14:58:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:58:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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 28 [2024-11-10 14:58:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:40,950 INFO L225 Difference]: With dead ends: 42 [2024-11-10 14:58:40,951 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 14:58:40,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2024-11-10 14:58:40,952 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 93 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:40,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 14:58:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 14:58:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 14:58:40,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-11-10 14:58:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:40,952 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 14:58:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 14:58:40,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 14:58:40,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2024-11-10 14:58:40,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-10 14:58:40,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-10 14:58:40,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2024-11-10 14:58:40,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 14:58:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:41,164 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:41,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:58:41,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:58:41 BoogieIcfgContainer [2024-11-10 14:58:41,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:58:41,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:58:41,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:58:41,171 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:58:41,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:34" (3/4) ... [2024-11-10 14:58:41,175 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:58:41,180 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 14:58:41,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 14:58:41,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 14:58:41,181 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:58:41,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:58:41,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:58:41,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:58:41,248 INFO L158 Benchmark]: Toolchain (without parser) took 7216.74ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 94.6MB in the beginning and 219.2MB in the end (delta: -124.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:58:41,248 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:58:41,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.11ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 94.4MB in the beginning and 203.8MB in the end (delta: -109.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.12ms. Allocated memory is still 237.0MB. Free memory was 203.8MB in the beginning and 201.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,249 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 237.0MB. Free memory was 201.7MB in the beginning and 199.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,249 INFO L158 Benchmark]: IcfgBuilder took 356.54ms. Allocated memory is still 237.0MB. Free memory was 199.5MB in the beginning and 185.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,249 INFO L158 Benchmark]: TraceAbstraction took 6285.50ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 183.9MB in the beginning and 224.1MB in the end (delta: -40.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,249 INFO L158 Benchmark]: Witness Printer took 76.43ms. Allocated memory is still 285.2MB. Free memory was 224.1MB in the beginning and 219.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:58:41,250 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.11ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 94.4MB in the beginning and 203.8MB in the end (delta: -109.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.12ms. Allocated memory is still 237.0MB. Free memory was 203.8MB in the beginning and 201.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 237.0MB. Free memory was 201.7MB in the beginning and 199.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 356.54ms. Allocated memory is still 237.0MB. Free memory was 199.5MB in the beginning and 185.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6285.50ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 183.9MB in the beginning and 224.1MB in the end (delta: -40.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 76.43ms. Allocated memory is still 285.2MB. Free memory was 224.1MB in the beginning and 219.2MB in the end (delta: 4.9MB). 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: 512]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 882 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 678 IncrementalHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 277 mSDtfsCounter, 678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 85 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 374 ConstructedInterpolants, 1 QuantifiedInterpolants, 3750 SizeOfPredicates, 14 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 52/101 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:58:41,283 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