./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/list-ext-properties/960521-1_1-3.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 b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:24:47,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:24:47,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:24:47,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:24:47,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:24:47,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:24:47,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:24:47,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:24:47,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:24:47,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:24:47,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:24:47,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:24:47,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:24:47,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:24:47,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:24:47,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:24:47,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:24:47,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:24:47,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:24:47,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:24:47,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:24:47,959 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:24:47,959 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:24:47,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:24:47,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:24:47,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:24:47,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:24:47,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:24:47,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:24:47,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:24:47,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:24:47,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:24:47,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:24:47,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:24:47,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:24:47,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:24:47,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:24:47,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:24:47,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:24:47,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:24:47,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:24:47,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:24:47,966 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 -> b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a [2024-11-17 00:24:48,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:24:48,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:24:48,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:24:48,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:24:48,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:24:48,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2024-11-17 00:24:49,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:24:49,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:24:49,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2024-11-17 00:24:49,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a8e9e93/c8aebc25b38c4c2a8f61a3de264cc088/FLAG7eb4a7b38 [2024-11-17 00:24:49,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a8e9e93/c8aebc25b38c4c2a8f61a3de264cc088 [2024-11-17 00:24:49,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:24:49,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:24:49,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:24:49,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:24:49,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:24:49,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:24:49" (1/1) ... [2024-11-17 00:24:49,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee24f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:49, skipping insertion in model container [2024-11-17 00:24:49,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:24:49" (1/1) ... [2024-11-17 00:24:49,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:24:50,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:24:50,371 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:24:50,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:24:50,442 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:24:50,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50 WrapperNode [2024-11-17 00:24:50,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:24:50,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:24:50,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:24:50,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:24:50,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,488 INFO L138 Inliner]: procedures = 122, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-11-17 00:24:50,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:24:50,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:24:50,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:24:50,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:24:50,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,519 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-17 00:24:50,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:24:50,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:24:50,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:24:50,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:24:50,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (1/1) ... [2024-11-17 00:24:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:24:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:50,575 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-17 00:24:50,580 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-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:24:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:24:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:24:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:24:50,725 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:24:50,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:24:50,912 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-17 00:24:50,914 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:24:50,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:24:50,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:24:50,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:24:50 BoogieIcfgContainer [2024-11-17 00:24:50,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:24:50,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:24:50,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:24:50,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:24:50,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:24:49" (1/3) ... [2024-11-17 00:24:50,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e33aa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:24:50, skipping insertion in model container [2024-11-17 00:24:50,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:24:50" (2/3) ... [2024-11-17 00:24:50,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e33aa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:24:50, skipping insertion in model container [2024-11-17 00:24:50,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:24:50" (3/3) ... [2024-11-17 00:24:50,942 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2024-11-17 00:24:50,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:24:50,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-17 00:24:51,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:24:51,014 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;@1f57a40e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:24:51,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-17 00:24:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.7) internal successors, (68), 61 states have internal predecessors, (68), 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-17 00:24:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:24:51,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:51,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:24:51,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:51,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 94444225, now seen corresponding path program 1 times [2024-11-17 00:24:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080942533] [2024-11-17 00:24:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:51,198 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-17 00:24:51,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080942533] [2024-11-17 00:24:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080942533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:24:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82190208] [2024-11-17 00:24:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:51,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:24:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:24:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:24:51,236 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.7) internal successors, (68), 61 states have internal predecessors, (68), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:51,248 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-11-17 00:24:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:24:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:24:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:51,255 INFO L225 Difference]: With dead ends: 62 [2024-11-17 00:24:51,255 INFO L226 Difference]: Without dead ends: 59 [2024-11-17 00:24:51,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:24:51,259 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:51,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-17 00:24:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-17 00:24:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.631578947368421) internal successors, (62), 58 states have internal predecessors, (62), 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-17 00:24:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-17 00:24:51,291 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 5 [2024-11-17 00:24:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:51,291 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-17 00:24:51,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-17 00:24:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:24:51,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:51,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:24:51,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:24:51,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1367224069, now seen corresponding path program 1 times [2024-11-17 00:24:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070680111] [2024-11-17 00:24:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:51,391 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-17 00:24:51,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070680111] [2024-11-17 00:24:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070680111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:24:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016204914] [2024-11-17 00:24:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:24:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:24:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:24:51,395 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 00:24:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:51,458 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-11-17 00:24:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:24:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-17 00:24:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:51,460 INFO L225 Difference]: With dead ends: 58 [2024-11-17 00:24:51,460 INFO L226 Difference]: Without dead ends: 58 [2024-11-17 00:24:51,460 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-17 00:24:51,461 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:51,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-17 00:24:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-17 00:24:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.605263157894737) internal successors, (61), 57 states have internal predecessors, (61), 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-17 00:24:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2024-11-17 00:24:51,471 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 6 [2024-11-17 00:24:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:51,471 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2024-11-17 00:24:51,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 00:24:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2024-11-17 00:24:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:24:51,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:51,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:24:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:24:51,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1367224068, now seen corresponding path program 1 times [2024-11-17 00:24:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281249391] [2024-11-17 00:24:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:51,738 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-17 00:24:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:51,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281249391] [2024-11-17 00:24:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281249391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:51,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:24:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179315461] [2024-11-17 00:24:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:51,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:24:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:51,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:24:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:51,743 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-17 00:24:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:51,864 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2024-11-17 00:24:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:24:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-17 00:24:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:51,866 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:24:51,866 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:24:51,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:24:51,867 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:51,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 148 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:24:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 62. [2024-11-17 00:24:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 61 states have internal predecessors, (66), 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-17 00:24:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-17 00:24:51,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 6 [2024-11-17 00:24:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-17 00:24:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-17 00:24:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-17 00:24:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:24:51,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:51,882 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:51,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:24:51,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 359664059, now seen corresponding path program 1 times [2024-11-17 00:24:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823894704] [2024-11-17 00:24:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:52,070 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-17 00:24:52,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:52,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823894704] [2024-11-17 00:24:52,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823894704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:52,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383409960] [2024-11-17 00:24:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:52,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:52,075 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-17 00:24:52,076 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-17 00:24:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:52,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:24:52,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:52,235 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-17 00:24:52,238 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-17 00:24:52,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:24:52,319 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-17 00:24:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383409960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:24:52,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:24:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-17 00:24:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125871967] [2024-11-17 00:24:52,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:24:52,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:24:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:24:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:24:52,326 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:52,539 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-17 00:24:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:24:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:24:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:52,541 INFO L225 Difference]: With dead ends: 167 [2024-11-17 00:24:52,543 INFO L226 Difference]: Without dead ends: 167 [2024-11-17 00:24:52,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:24:52,545 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 332 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:52,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 474 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-17 00:24:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 57. [2024-11-17 00:24:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 56 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-17 00:24:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2024-11-17 00:24:52,557 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 8 [2024-11-17 00:24:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:52,557 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2024-11-17 00:24:52,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-11-17 00:24:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:24:52,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:52,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:52,577 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-17 00:24:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:52,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 116884053, now seen corresponding path program 1 times [2024-11-17 00:24:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:52,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409168542] [2024-11-17 00:24:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:52,857 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-17 00:24:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409168542] [2024-11-17 00:24:52,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409168542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:52,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:52,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:24:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196807996] [2024-11-17 00:24:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:24:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:24:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:52,859 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 00:24:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:52,894 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-17 00:24:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:24:52,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 00:24:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:52,898 INFO L225 Difference]: With dead ends: 54 [2024-11-17 00:24:52,898 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 00:24:52,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 00:24:52,899 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 56 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:52,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 00:24:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-17 00:24:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.5) internal successors, (57), 53 states have internal predecessors, (57), 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-17 00:24:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-11-17 00:24:52,907 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2024-11-17 00:24:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:52,908 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-11-17 00:24:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 00:24:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-11-17 00:24:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:24:52,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:52,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:24:52,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:52,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 116884054, now seen corresponding path program 1 times [2024-11-17 00:24:52,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:52,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569539183] [2024-11-17 00:24:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,118 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-17 00:24:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569539183] [2024-11-17 00:24:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569539183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:53,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:24:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881686102] [2024-11-17 00:24:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:24:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:24:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:24:53,124 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-17 00:24:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:53,202 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-17 00:24:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:24:53,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-17 00:24:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:53,204 INFO L225 Difference]: With dead ends: 61 [2024-11-17 00:24:53,204 INFO L226 Difference]: Without dead ends: 61 [2024-11-17 00:24:53,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:24:53,205 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:53,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 91 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-17 00:24:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-17 00:24:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 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-17 00:24:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-11-17 00:24:53,211 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 10 [2024-11-17 00:24:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:53,212 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-17 00:24:53,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-17 00:24:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-17 00:24:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:24:53,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:53,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:53,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:24:53,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:53,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1126621384, now seen corresponding path program 1 times [2024-11-17 00:24:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849567048] [2024-11-17 00:24:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,256 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-17 00:24:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849567048] [2024-11-17 00:24:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849567048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:24:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933983949] [2024-11-17 00:24:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:24:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:24:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:53,261 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-17 00:24:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:53,292 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-17 00:24:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:24:53,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-17 00:24:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:53,293 INFO L225 Difference]: With dead ends: 105 [2024-11-17 00:24:53,293 INFO L226 Difference]: Without dead ends: 105 [2024-11-17 00:24:53,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-17 00:24:53,294 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:53,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-17 00:24:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2024-11-17 00:24:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.375) internal successors, (77), 69 states have internal predecessors, (77), 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-17 00:24:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-17 00:24:53,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 13 [2024-11-17 00:24:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:53,299 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-17 00:24:53,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-17 00:24:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-17 00:24:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:24:53,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:53,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:53,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:24:53,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:53,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash -534948936, now seen corresponding path program 1 times [2024-11-17 00:24:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961796216] [2024-11-17 00:24:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961796216] [2024-11-17 00:24:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961796216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857755532] [2024-11-17 00:24:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:53,357 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-17 00:24:53,358 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-17 00:24:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:24:53,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:53,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:24:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857755532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:24:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-17 00:24:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208775486] [2024-11-17 00:24:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:24:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:24:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:24:53,491 INFO L87 Difference]: Start difference. First operand 70 states and 77 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-17 00:24:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:53,531 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-17 00:24:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:24:53,532 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-17 00:24:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:53,533 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:24:53,533 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:24:53,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:24:53,534 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 36 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:53,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 202 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:24:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2024-11-17 00:24:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 68 states have internal predecessors, (74), 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-17 00:24:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-17 00:24:53,543 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 14 [2024-11-17 00:24:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-17 00:24:53,543 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-17 00:24:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-17 00:24:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:24:53,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:53,544 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:53,562 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-17 00:24:53,744 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,SelfDestructingSolverStorable7 [2024-11-17 00:24:53,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 284975513, now seen corresponding path program 1 times [2024-11-17 00:24:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533291148] [2024-11-17 00:24:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,790 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-17 00:24:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533291148] [2024-11-17 00:24:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533291148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:24:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307571486] [2024-11-17 00:24:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:24:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:24:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:53,792 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-17 00:24:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:53,839 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-17 00:24:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:24:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 15 [2024-11-17 00:24:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:53,840 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:24:53,840 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:24:53,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:24:53,841 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:24:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-17 00:24:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.309090909090909) internal successors, (72), 66 states have internal predecessors, (72), 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-17 00:24:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-17 00:24:53,845 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 15 [2024-11-17 00:24:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-17 00:24:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-17 00:24:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-17 00:24:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:24:53,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:53,846 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:53,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:24:53,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 284975514, now seen corresponding path program 1 times [2024-11-17 00:24:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890283538] [2024-11-17 00:24:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,897 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-17 00:24:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890283538] [2024-11-17 00:24:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890283538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195013740] [2024-11-17 00:24:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:53,901 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-17 00:24:53,902 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-17 00:24:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:53,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:24:53,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:53,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:24:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195013740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:24:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 00:24:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216962547] [2024-11-17 00:24:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:24:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:53,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:24:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:24:53,990 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:54,038 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-17 00:24:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:24:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:24:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:54,041 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:24:54,041 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:24:54,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:24:54,041 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 102 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:54,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 156 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:24:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2024-11-17 00:24:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.280701754385965) internal successors, (73), 68 states have internal predecessors, (73), 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-17 00:24:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-17 00:24:54,048 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2024-11-17 00:24:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-17 00:24:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-17 00:24:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:24:54,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:54,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:54,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:24:54,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:54,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash 274881911, now seen corresponding path program 1 times [2024-11-17 00:24:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449750814] [2024-11-17 00:24:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:54,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449750814] [2024-11-17 00:24:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449750814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704052012] [2024-11-17 00:24:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:54,539 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-17 00:24:54,541 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-17 00:24:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:54,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 00:24:54,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:54,651 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:24:54,651 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 1 case distinctions, treesize of input 9 treesize of output 11 [2024-11-17 00:24:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:54,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:24:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704052012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:24:55,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:24:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-11-17 00:24:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914158612] [2024-11-17 00:24:55,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:24:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 00:24:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 00:24:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:24:55,070 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 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-17 00:24:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:55,737 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2024-11-17 00:24:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:24:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 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) Word has length 16 [2024-11-17 00:24:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:55,739 INFO L225 Difference]: With dead ends: 170 [2024-11-17 00:24:55,739 INFO L226 Difference]: Without dead ends: 170 [2024-11-17 00:24:55,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2024-11-17 00:24:55,740 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 426 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:55,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 658 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:24:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-17 00:24:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 94. [2024-11-17 00:24:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 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-17 00:24:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-17 00:24:55,748 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 16 [2024-11-17 00:24:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:55,749 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-17 00:24:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 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-17 00:24:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-17 00:24:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:24:55,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:55,750 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:55,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:24:55,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:55,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 595924018, now seen corresponding path program 1 times [2024-11-17 00:24:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438795749] [2024-11-17 00:24:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:56,026 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-17 00:24:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438795749] [2024-11-17 00:24:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438795749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:24:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855994818] [2024-11-17 00:24:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:56,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:24:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:24:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:56,028 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-17 00:24:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:56,051 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-11-17 00:24:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:24:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-17 00:24:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:56,052 INFO L225 Difference]: With dead ends: 79 [2024-11-17 00:24:56,052 INFO L226 Difference]: Without dead ends: 79 [2024-11-17 00:24:56,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:24:56,053 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:56,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-17 00:24:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-17 00:24:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 78 states have internal predecessors, (87), 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-17 00:24:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-17 00:24:56,056 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 18 [2024-11-17 00:24:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:56,056 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-17 00:24:56,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-17 00:24:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-17 00:24:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:24:56,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:56,057 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:56,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:24:56,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash 879998553, now seen corresponding path program 2 times [2024-11-17 00:24:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098145624] [2024-11-17 00:24:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:56,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098145624] [2024-11-17 00:24:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098145624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529511998] [2024-11-17 00:24:56,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:24:56,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:56,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:56,135 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-17 00:24:56,137 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-17 00:24:56,214 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:24:56,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:24:56,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:24:56,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:56,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:24:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529511998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:24:56,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:24:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-17 00:24:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763044776] [2024-11-17 00:24:56,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:24:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:24:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:24:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:24:56,354 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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-17 00:24:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:56,445 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-17 00:24:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:24:56,446 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 20 [2024-11-17 00:24:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:56,446 INFO L225 Difference]: With dead ends: 115 [2024-11-17 00:24:56,447 INFO L226 Difference]: Without dead ends: 115 [2024-11-17 00:24:56,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:24:56,448 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 90 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:56,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-17 00:24:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2024-11-17 00:24:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 77 states have internal predecessors, (84), 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-17 00:24:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-11-17 00:24:56,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 20 [2024-11-17 00:24:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:56,451 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-11-17 00:24:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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-17 00:24:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-11-17 00:24:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:24:56,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:56,452 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:56,469 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-17 00:24:56,652 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,SelfDestructingSolverStorable12 [2024-11-17 00:24:56,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2066848281, now seen corresponding path program 1 times [2024-11-17 00:24:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930640083] [2024-11-17 00:24:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:24:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930640083] [2024-11-17 00:24:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930640083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697264093] [2024-11-17 00:24:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:56,721 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-17 00:24:56,723 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-17 00:24:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:56,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:24:56,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:56,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:24:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697264093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:24:56,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:24:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2024-11-17 00:24:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053142023] [2024-11-17 00:24:56,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:24:56,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:24:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:56,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:24:56,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:24:56,917 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-17 00:24:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:57,135 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2024-11-17 00:24:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:24:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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 21 [2024-11-17 00:24:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:57,136 INFO L225 Difference]: With dead ends: 124 [2024-11-17 00:24:57,136 INFO L226 Difference]: Without dead ends: 124 [2024-11-17 00:24:57,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:24:57,137 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 226 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:57,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 334 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:24:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-17 00:24:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2024-11-17 00:24:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 84 states have internal predecessors, (91), 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-17 00:24:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-17 00:24:57,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 21 [2024-11-17 00:24:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:57,140 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-17 00:24:57,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-17 00:24:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-17 00:24:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:24:57,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:57,141 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:57,157 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-17 00:24:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:57,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2072560978, now seen corresponding path program 1 times [2024-11-17 00:24:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660749464] [2024-11-17 00:24:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:57,369 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-17 00:24:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:57,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660749464] [2024-11-17 00:24:57,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660749464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:24:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:24:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:24:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088192784] [2024-11-17 00:24:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:24:57,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:24:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:24:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:24:57,371 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:57,384 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-17 00:24:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:24:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:24:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:57,385 INFO L225 Difference]: With dead ends: 83 [2024-11-17 00:24:57,385 INFO L226 Difference]: Without dead ends: 83 [2024-11-17 00:24:57,386 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-17 00:24:57,387 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:57,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:24:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-17 00:24:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-17 00:24:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 82 states have internal predecessors, (89), 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-17 00:24:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-17 00:24:57,389 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 21 [2024-11-17 00:24:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:57,390 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-17 00:24:57,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:24:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-17 00:24:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:24:57,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:57,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:24:57,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash -321637160, now seen corresponding path program 3 times [2024-11-17 00:24:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808664419] [2024-11-17 00:24:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:24:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808664419] [2024-11-17 00:24:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808664419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490749971] [2024-11-17 00:24:57,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:24:57,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:57,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:57,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:24:57,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:24:57,823 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:24:57,823 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:24:57,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:24:57,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:57,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-17 00:24:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:24:57,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:24:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:24:58,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:24:58,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:24:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:24:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490749971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:24:58,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:24:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-17 00:24:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863719726] [2024-11-17 00:24:58,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:24:58,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:24:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:24:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:24:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:24:58,293 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-17 00:24:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:24:59,071 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-17 00:24:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:24:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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 22 [2024-11-17 00:24:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:24:59,073 INFO L225 Difference]: With dead ends: 119 [2024-11-17 00:24:59,074 INFO L226 Difference]: Without dead ends: 119 [2024-11-17 00:24:59,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2024-11-17 00:24:59,075 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 342 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:24:59,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 254 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:24:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-17 00:24:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2024-11-17 00:24:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 81 states have internal predecessors, (88), 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-17 00:24:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-17 00:24:59,079 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 22 [2024-11-17 00:24:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:24:59,079 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-17 00:24:59,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-17 00:24:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-17 00:24:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:24:59,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:24:59,080 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:24:59,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 00:24:59,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:59,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:24:59,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:24:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash -444479402, now seen corresponding path program 2 times [2024-11-17 00:24:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:24:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161449026] [2024-11-17 00:24:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:24:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:24:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:24:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:24:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:24:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161449026] [2024-11-17 00:24:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161449026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:24:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707319808] [2024-11-17 00:24:59,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:24:59,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:24:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:24:59,497 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:24:59,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:24:59,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:24:59,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:24:59,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 00:24:59,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:24:59,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-17 00:24:59,632 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-17 00:24:59,641 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 10 treesize of output 8 [2024-11-17 00:25:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:25:00,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:25:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707319808] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:00,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:25:00,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2024-11-17 00:25:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460579174] [2024-11-17 00:25:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:00,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:25:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:25:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:25:00,209 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-17 00:25:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:00,347 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2024-11-17 00:25:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:25:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-17 00:25:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:00,348 INFO L225 Difference]: With dead ends: 99 [2024-11-17 00:25:00,348 INFO L226 Difference]: Without dead ends: 99 [2024-11-17 00:25:00,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:25:00,349 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:00,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 72 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-17 00:25:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2024-11-17 00:25:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 81 states have internal predecessors, (86), 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-17 00:25:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-17 00:25:00,352 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 23 [2024-11-17 00:25:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:00,352 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-17 00:25:00,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-17 00:25:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-17 00:25:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:25:00,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:00,354 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:00,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:25:00,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 00:25:00,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-17 00:25:00,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -785752725, now seen corresponding path program 1 times [2024-11-17 00:25:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581568352] [2024-11-17 00:25:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:25:00,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:25:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:25:00,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:25:00,617 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:25:00,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2024-11-17 00:25:00,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 21 remaining) [2024-11-17 00:25:00,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 21 remaining) [2024-11-17 00:25:00,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 21 remaining) [2024-11-17 00:25:00,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2024-11-17 00:25:00,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2024-11-17 00:25:00,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2024-11-17 00:25:00,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 21 remaining) [2024-11-17 00:25:00,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2024-11-17 00:25:00,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2024-11-17 00:25:00,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2024-11-17 00:25:00,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2024-11-17 00:25:00,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2024-11-17 00:25:00,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-17 00:25:00,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-17 00:25:00,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:25:00,629 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:00,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:25:00,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:25:00 BoogieIcfgContainer [2024-11-17 00:25:00,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:25:00,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:25:00,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:25:00,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:25:00,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:24:50" (3/4) ... [2024-11-17 00:25:00,664 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 00:25:00,708 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:25:00,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:25:00,709 INFO L158 Benchmark]: Toolchain (without parser) took 10782.29ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 61.1MB in the beginning and 202.6MB in the end (delta: -141.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:25:00,712 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:25:00,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.36ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 60.9MB in the beginning and 127.1MB in the end (delta: -66.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-17 00:25:00,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:25:00,713 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:25:00,713 INFO L158 Benchmark]: IcfgBuilder took 385.75ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 107.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:25:00,713 INFO L158 Benchmark]: TraceAbstraction took 9727.88ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 106.1MB in the beginning and 204.7MB in the end (delta: -98.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:25:00,714 INFO L158 Benchmark]: Witness Printer took 46.66ms. Allocated memory is still 243.3MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:25:00,715 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.20ms. Allocated memory is still 132.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.36ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 60.9MB in the beginning and 127.1MB in the end (delta: -66.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 385.75ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 107.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9727.88ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 106.1MB in the beginning and 204.7MB in the end (delta: -98.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 46.66ms. Allocated memory is still 243.3MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 547]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L536] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L537] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L540] a = malloc(n * sizeof(*a)) [L541] b = malloc(n * sizeof(*b)) [L542] EXPR b++ VAL [a={-3:0}, b={-2:4}, n=1] [L542] *b++ = 0 VAL [a={-3:0}, b={-2:4}, n=1] [L543] CALL foo() [L528] int i; [L529] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L529] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L530] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=1] [L529] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=1] [L529] COND FALSE !(i < n) VAL [a={-3:0}, b={-2:4}, n=1] [L531] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L531] COND FALSE !(i < n - 1) VAL [a={-3:0}, b={-2:4}, n=1] [L543] RET foo() [L544] b[-1] VAL [a={-3:0}, b={-2:4}, n=1] [L544] COND FALSE !(b[-1]) [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(b) VAL [a={-3:0}, b={-2:4}, n=1] - UnprovableResult [Line: 534]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1889 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1889 mSDsluCounter, 3074 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2112 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2125 IncrementalHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 962 mSDtfsCounter, 2125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, InterpolantAutomatonStates: 120, 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, 17 MinimizatonAttempts, 476 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 406 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 461 ConstructedInterpolants, 15 QuantifiedInterpolants, 3910 SizeOfPredicates, 23 NumberOfNonLiveVariables, 720 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 94/175 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-17 00:25:00,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)