./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrncpy_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 99fa7faeff0fbb15c403f314a2e472d357eac4283760e9e7213aeabb8b292c8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:22:47,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:22:47,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-17 00:22:47,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:22:47,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:22:47,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:22:47,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:22:47,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:22:47,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:22:47,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:22:47,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:22:47,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:22:47,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:22:47,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:22:47,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:22:47,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:22:47,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:22:47,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:22:47,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:22:47,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:22:47,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:22:47,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:22:47,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:22:47,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:22:47,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:22:47,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:22:47,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:22:47,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:22:47,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:22:47,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:22:47,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:22:47,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:22:47,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:22:47,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:22:47,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:22:47,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:22:47,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:22:47,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:22:47,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:22:47,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99fa7faeff0fbb15c403f314a2e472d357eac4283760e9e7213aeabb8b292c8a [2024-11-17 00:22:47,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:22:47,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:22:47,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:22:47,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:22:47,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:22:47,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2024-11-17 00:22:49,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:22:49,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:22:49,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2024-11-17 00:22:49,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5800d7d12/4fd98e9bcf444f5086292b34ab9d6c22/FLAGcb3ca3042 [2024-11-17 00:22:49,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5800d7d12/4fd98e9bcf444f5086292b34ab9d6c22 [2024-11-17 00:22:49,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:22:49,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:22:49,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:22:49,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:22:49,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:22:49,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:49" (1/1) ... [2024-11-17 00:22:49,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1658217e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:49, skipping insertion in model container [2024-11-17 00:22:49,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:49" (1/1) ... [2024-11-17 00:22:49,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:22:49,939 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:22:49,940 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:22:49,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:22:49,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:22:49,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:22:50,009 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:22:50,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50 WrapperNode [2024-11-17 00:22:50,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:22:50,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:22:50,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:22:50,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:22:50,017 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:22:50" (1/1) ... [2024-11-17 00:22:50,030 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:22:50" (1/1) ... [2024-11-17 00:22:50,050 INFO L138 Inliner]: procedures = 152, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-11-17 00:22:50,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:22:50,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:22:50,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:22:50,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:22:50,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,078 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2024-11-17 00:22:50,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:22:50,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:22:50,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:22:50,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:22:50,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (1/1) ... [2024-11-17 00:22:50,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:22:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:50,127 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:22:50,139 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:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:22:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:22:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:22:50,260 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:22:50,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:22:50,437 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: call ULTIMATE.dealloc(main_#t~malloc213#1.base, main_#t~malloc213#1.offset);havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call ULTIMATE.dealloc(main_#t~malloc214#1.base, main_#t~malloc214#1.offset);havoc main_#t~malloc214#1.base, main_#t~malloc214#1.offset; [2024-11-17 00:22:50,456 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-17 00:22:50,456 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:22:50,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:22:50,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:22:50,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:50 BoogieIcfgContainer [2024-11-17 00:22:50,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:22:50,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:22:50,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:22:50,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:22:50,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:22:49" (1/3) ... [2024-11-17 00:22:50,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed43f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:50, skipping insertion in model container [2024-11-17 00:22:50,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:50" (2/3) ... [2024-11-17 00:22:50,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed43f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:50, skipping insertion in model container [2024-11-17 00:22:50,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:50" (3/3) ... [2024-11-17 00:22:50,480 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy_mixed_alloca.i [2024-11-17 00:22:50,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:22:50,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-17 00:22:50,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:22:50,542 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;@45b6c56c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:22:50,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-17 00:22:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:50,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:50,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:50,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2128990940, now seen corresponding path program 1 times [2024-11-17 00:22:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109378141] [2024-11-17 00:22:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109378141] [2024-11-17 00:22:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109378141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:50,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:50,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:22:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648408712] [2024-11-17 00:22:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:22:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:22:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:22:50,823 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:22:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:50,865 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-17 00:22:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:22:50,868 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:22:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:50,874 INFO L225 Difference]: With dead ends: 30 [2024-11-17 00:22:50,877 INFO L226 Difference]: Without dead ends: 27 [2024-11-17 00:22:50,879 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:22:50,886 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:50,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-17 00:22:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-17 00:22:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 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:22:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-17 00:22:50,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2024-11-17 00:22:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:50,944 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-17 00:22:50,944 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:22:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-17 00:22:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:50,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:50,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:50,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:22:50,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:50,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2128990941, now seen corresponding path program 1 times [2024-11-17 00:22:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915464585] [2024-11-17 00:22:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:51,210 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:22:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915464585] [2024-11-17 00:22:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915464585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950183421] [2024-11-17 00:22:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:51,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:51,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:51,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:51,217 INFO L87 Difference]: Start difference. First operand 27 states and 31 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:22:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:51,238 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-17 00:22:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:51,239 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:22:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:51,240 INFO L225 Difference]: With dead ends: 30 [2024-11-17 00:22:51,240 INFO L226 Difference]: Without dead ends: 30 [2024-11-17 00:22:51,241 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:22:51,242 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:51,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-17 00:22:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-17 00:22:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 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:22:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-17 00:22:51,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2024-11-17 00:22:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:51,249 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-17 00:22:51,249 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:22:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-17 00:22:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:22:51,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:51,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:22:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:22:51,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2129020732, now seen corresponding path program 1 times [2024-11-17 00:22:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999085541] [2024-11-17 00:22:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:51,475 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:22:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999085541] [2024-11-17 00:22:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999085541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823222999] [2024-11-17 00:22:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:51,479 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:22:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:51,497 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-17 00:22:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:22:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:51,499 INFO L225 Difference]: With dead ends: 29 [2024-11-17 00:22:51,499 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 00:22:51,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:51,500 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:51,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 00:22:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-17 00:22:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 25 states have internal predecessors, (30), 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:22:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-17 00:22:51,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2024-11-17 00:22:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:51,504 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-17 00:22:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:22:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-17 00:22:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:22:51,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:51,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:51,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:22:51,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:51,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:51,505 INFO L85 PathProgramCache]: Analyzing trace with hash 533327220, now seen corresponding path program 1 times [2024-11-17 00:22:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72957891] [2024-11-17 00:22:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:51,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:51,595 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:22:51,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72957891] [2024-11-17 00:22:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72957891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368896904] [2024-11-17 00:22:51,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:51,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:51,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:51,600 INFO L87 Difference]: Start difference. First operand 26 states and 30 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:22:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:51,648 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-17 00:22:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:51,648 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:22:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:51,649 INFO L225 Difference]: With dead ends: 25 [2024-11-17 00:22:51,649 INFO L226 Difference]: Without dead ends: 25 [2024-11-17 00:22:51,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:51,650 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:51,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-17 00:22:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-17 00:22:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-17 00:22:51,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2024-11-17 00:22:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:51,653 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-17 00:22:51,653 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:22:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-17 00:22:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:22:51,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:51,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:51,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:22:51,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 533327221, now seen corresponding path program 1 times [2024-11-17 00:22:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236085997] [2024-11-17 00:22:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:51,775 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:22:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236085997] [2024-11-17 00:22:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236085997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:22:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872652210] [2024-11-17 00:22:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:22:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:22:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:51,778 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:22:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:51,820 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-17 00:22:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:22:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:51,821 INFO L225 Difference]: With dead ends: 30 [2024-11-17 00:22:51,821 INFO L226 Difference]: Without dead ends: 30 [2024-11-17 00:22:51,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:51,822 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:51,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-17 00:22:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-17 00:22:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-17 00:22:51,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 10 [2024-11-17 00:22:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:51,825 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-17 00:22:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:22:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-17 00:22:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:22:51,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:51,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:22:51,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash -646725374, now seen corresponding path program 1 times [2024-11-17 00:22:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244411293] [2024-11-17 00:22:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:51,910 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:22:51,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244411293] [2024-11-17 00:22:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244411293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928103070] [2024-11-17 00:22:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:51,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:22:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:22:51,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:22:51,912 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:51,944 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-17 00:22:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:22:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:22:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:51,945 INFO L225 Difference]: With dead ends: 29 [2024-11-17 00:22:51,945 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 00:22:51,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:51,946 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:51,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 00:22:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-17 00:22:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 states have internal predecessors, (32), 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:22:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-17 00:22:51,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 11 [2024-11-17 00:22:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:51,949 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-17 00:22:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-17 00:22:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:22:51,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:51,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:22:51,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -646725373, now seen corresponding path program 1 times [2024-11-17 00:22:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280022242] [2024-11-17 00:22:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:52,083 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:22:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280022242] [2024-11-17 00:22:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280022242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:22:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881349829] [2024-11-17 00:22:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:22:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:22:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:52,085 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:52,121 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-17 00:22:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:22:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:22:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:52,122 INFO L225 Difference]: With dead ends: 36 [2024-11-17 00:22:52,122 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 00:22:52,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:52,123 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:52,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 00:22:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-17 00:22:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-17 00:22:52,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 11 [2024-11-17 00:22:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:52,126 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-17 00:22:52,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-17 00:22:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:22:52,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:52,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:22:52,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:52,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1096084962, now seen corresponding path program 1 times [2024-11-17 00:22:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276891103] [2024-11-17 00:22:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:52,294 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:22:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276891103] [2024-11-17 00:22:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276891103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:52,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:52,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:22:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443216651] [2024-11-17 00:22:52,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:52,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:22:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:22:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:52,297 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:52,333 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-17 00:22:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:52,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:22:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:52,334 INFO L225 Difference]: With dead ends: 37 [2024-11-17 00:22:52,334 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 00:22:52,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:52,335 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:52,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 00:22:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2024-11-17 00:22:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-17 00:22:52,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 11 [2024-11-17 00:22:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:52,339 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-17 00:22:52,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-17 00:22:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:22:52,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:52,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:52,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:22:52,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1264865279, now seen corresponding path program 1 times [2024-11-17 00:22:52,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787151677] [2024-11-17 00:22:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:52,390 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:22:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787151677] [2024-11-17 00:22:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787151677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:22:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174509756] [2024-11-17 00:22:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:52,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:52,392 INFO L87 Difference]: Start difference. First operand 28 states and 33 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:22:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:52,419 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-17 00:22:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:52,419 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:22:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:52,420 INFO L225 Difference]: With dead ends: 28 [2024-11-17 00:22:52,420 INFO L226 Difference]: Without dead ends: 28 [2024-11-17 00:22:52,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:52,425 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:52,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-17 00:22:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-17 00:22:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 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:22:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-17 00:22:52,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2024-11-17 00:22:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:52,431 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 00:22:52,431 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:22:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-17 00:22:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:52,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:52,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:52,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:22:52,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2017344230, now seen corresponding path program 1 times [2024-11-17 00:22:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:52,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856495161] [2024-11-17 00:22:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:52,546 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:22:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856495161] [2024-11-17 00:22:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856495161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:22:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672009803] [2024-11-17 00:22:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:52,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:22:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:22:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:22:52,551 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:52,657 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-17 00:22:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:22:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:52,658 INFO L225 Difference]: With dead ends: 29 [2024-11-17 00:22:52,658 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 00:22:52,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:22:52,659 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:52,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 00:22:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-17 00:22:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 states have internal predecessors, (31), 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:22:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-17 00:22:52,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2024-11-17 00:22:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-17 00:22:52,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-17 00:22:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:52,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:52,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:52,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:22:52,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:52,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2017344229, now seen corresponding path program 1 times [2024-11-17 00:22:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007815389] [2024-11-17 00:22:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:52,751 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:22:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007815389] [2024-11-17 00:22:52,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007815389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:52,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:52,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:22:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588494418] [2024-11-17 00:22:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:52,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:22:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:22:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:52,755 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:22:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:52,805 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-17 00:22:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:22:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:52,807 INFO L225 Difference]: With dead ends: 39 [2024-11-17 00:22:52,807 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 00:22:52,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:22:52,808 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:52,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 00:22:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-17 00:22:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-17 00:22:52,811 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 15 [2024-11-17 00:22:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:52,812 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 00:22:52,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:22:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-17 00:22:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:52,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:52,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:52,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:22:52,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1888261510, now seen corresponding path program 1 times [2024-11-17 00:22:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707472241] [2024-11-17 00:22:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707472241] [2024-11-17 00:22:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707472241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:22:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630100051] [2024-11-17 00:22:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:22:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:22:53,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:22:53,083 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:22:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:53,175 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-17 00:22:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:22:53,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:22:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:53,176 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:22:53,176 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:22:53,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:22:53,179 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:53,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 101 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:22:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-17 00:22:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-17 00:22:53,181 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 15 [2024-11-17 00:22:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-17 00:22:53,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:22:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-17 00:22:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:53,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:53,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:22:53,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1888217817, now seen corresponding path program 1 times [2024-11-17 00:22:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427053335] [2024-11-17 00:22:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:53,331 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:22:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427053335] [2024-11-17 00:22:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427053335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:22:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133268511] [2024-11-17 00:22:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:22:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:22:53,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:22:53,335 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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:22:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:53,377 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-17 00:22:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:22:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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:22:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:53,378 INFO L225 Difference]: With dead ends: 59 [2024-11-17 00:22:53,378 INFO L226 Difference]: Without dead ends: 59 [2024-11-17 00:22:53,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:22:53,379 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:53,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-17 00:22:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-17 00:22:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2) internal successors, (66), 58 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:22:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-17 00:22:53,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 15 [2024-11-17 00:22:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:53,385 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-17 00:22:53,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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:22:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-17 00:22:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:22:53,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:53,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:53,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:22:53,386 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:53,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2113346472, now seen corresponding path program 1 times [2024-11-17 00:22:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799877504] [2024-11-17 00:22:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:53,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799877504] [2024-11-17 00:22:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799877504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127001207] [2024-11-17 00:22:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:53,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:53,661 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:22:53,663 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:22:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:53,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:22:53,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:53,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2024-11-17 00:22:53,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:22:53,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-17 00:22:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:54,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:54,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 11 [2024-11-17 00:22:54,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-17 00:22:54,340 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 13 treesize of output 9 [2024-11-17 00:22:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127001207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:54,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-17 00:22:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863761526] [2024-11-17 00:22:54,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:54,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 00:22:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 00:22:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:22:54,353 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:54,541 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-17 00:22:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:22:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:22:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:54,542 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:22:54,542 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:22:54,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:22:54,543 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:54,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:22:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-17 00:22:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 62 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:22:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-11-17 00:22:54,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 15 [2024-11-17 00:22:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:54,546 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-11-17 00:22:54,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-11-17 00:22:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:22:54,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:54,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:54,560 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:22:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:22:54,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1089231152, now seen corresponding path program 1 times [2024-11-17 00:22:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917468094] [2024-11-17 00:22:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917468094] [2024-11-17 00:22:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917468094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:54,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714777938] [2024-11-17 00:22:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:54,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:54,889 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:22:54,891 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:22:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:54,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:22:54,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:55,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:55,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:22:55,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-17 00:22:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714777938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:55,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-17 00:22:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281460267] [2024-11-17 00:22:55,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:55,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:22:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:22:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:22:55,241 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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:22:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:55,336 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-17 00:22:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:22:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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:22:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:55,337 INFO L225 Difference]: With dead ends: 62 [2024-11-17 00:22:55,337 INFO L226 Difference]: Without dead ends: 62 [2024-11-17 00:22:55,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:22:55,338 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:55,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-17 00:22:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-17 00:22:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 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:22:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-11-17 00:22:55,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 16 [2024-11-17 00:22:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:55,344 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-17 00:22:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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:22:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-17 00:22:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:22:55,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:55,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:55,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:22:55,545 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,SelfDestructingSolverStorable14 [2024-11-17 00:22:55,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:55,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 773516235, now seen corresponding path program 1 times [2024-11-17 00:22:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264060291] [2024-11-17 00:22:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:55,664 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:22:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264060291] [2024-11-17 00:22:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264060291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:22:55,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:22:55,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:22:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81164816] [2024-11-17 00:22:55,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:22:55,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:22:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:55,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:22:55,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:55,666 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:55,688 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-17 00:22:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:22:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:22:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:55,689 INFO L225 Difference]: With dead ends: 61 [2024-11-17 00:22:55,689 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 00:22:55,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:22:55,689 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:55,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:22:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 00:22:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 00:22:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-17 00:22:55,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2024-11-17 00:22:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:55,692 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-17 00:22:55,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-17 00:22:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:22:55,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:55,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:55,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:22:55,693 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2012012428, now seen corresponding path program 1 times [2024-11-17 00:22:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249149161] [2024-11-17 00:22:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249149161] [2024-11-17 00:22:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249149161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773607658] [2024-11-17 00:22:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:55,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:55,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:55,956 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:22:55,957 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:22:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:56,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-17 00:22:56,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:56,162 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:22:56,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:56,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:22:56,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:22:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773607658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:56,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-17 00:22:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725005744] [2024-11-17 00:22:56,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:22:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:22:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:22:56,445 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:56,632 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-17 00:22:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:22:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:22:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:56,633 INFO L225 Difference]: With dead ends: 36 [2024-11-17 00:22:56,633 INFO L226 Difference]: Without dead ends: 21 [2024-11-17 00:22:56,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:22:56,634 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:56,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 146 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:22:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-17 00:22:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 00:22:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-17 00:22:56,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2024-11-17 00:22:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:56,636 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-17 00:22:56,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-17 00:22:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:22:56,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:22:56,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:56,649 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:22:56,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:56,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:22:56,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:22:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -743888523, now seen corresponding path program 2 times [2024-11-17 00:22:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:22:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867989671] [2024-11-17 00:22:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:22:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:22:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:22:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:57,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:22:57,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867989671] [2024-11-17 00:22:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867989671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:22:57,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806246164] [2024-11-17 00:22:57,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:22:57,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:22:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:22:57,197 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:22:57,202 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:22:57,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:22:57,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:22:57,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-17 00:22:57,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:22:57,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2024-11-17 00:22:57,600 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-11-17 00:22:57,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-11-17 00:22:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:57,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:22:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 25 [2024-11-17 00:22:58,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-17 00:22:58,074 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 5 treesize of output 3 [2024-11-17 00:22:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:22:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806246164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:22:58,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:22:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-17 00:22:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395941469] [2024-11-17 00:22:58,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:22:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:22:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:22:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:22:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:22:58,101 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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:22:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:22:58,527 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-17 00:22:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:22:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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 20 [2024-11-17 00:22:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:22:58,528 INFO L225 Difference]: With dead ends: 20 [2024-11-17 00:22:58,528 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:22:58,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-11-17 00:22:58,529 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:22:58,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:22:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:22:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:22:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:22:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:22:58,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-11-17 00:22:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:22:58,530 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:22:58,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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:22:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:22:58,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:22:58,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2024-11-17 00:22:58,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-17 00:22:58,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-17 00:22:58,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2024-11-17 00:22:58,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:22:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 00:22:58,741 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:22:58,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:22:58,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:22:58 BoogieIcfgContainer [2024-11-17 00:22:58,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:22:58,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:22:58,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:22:58,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:22:58,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:22:50" (3/4) ... [2024-11-17 00:22:58,757 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:22:58,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-17 00:22:58,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:22:58,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-17 00:22:58,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:22:58,837 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:22:58,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:22:58,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:22:58,838 INFO L158 Benchmark]: Toolchain (without parser) took 9248.80ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 89.5MB in the beginning and 110.0MB in the end (delta: -20.5MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,838 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:22:58,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.12ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 114.1MB in the end (delta: -24.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.50ms. Allocated memory is still 159.4MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,839 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,839 INFO L158 Benchmark]: IcfgBuilder took 382.24ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 94.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,839 INFO L158 Benchmark]: TraceAbstraction took 8271.97ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 94.1MB in the beginning and 115.6MB in the end (delta: -21.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,839 INFO L158 Benchmark]: Witness Printer took 88.40ms. Allocated memory is still 251.7MB. Free memory was 115.6MB in the beginning and 110.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 00:22:58,840 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.11ms. Allocated memory is still 109.1MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.12ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 114.1MB in the end (delta: -24.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.50ms. Allocated memory is still 159.4MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 382.24ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 94.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8271.97ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 94.1MB in the beginning and 115.6MB in the end (delta: -21.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 88.40ms. Allocated memory is still 251.7MB. Free memory was 115.6MB in the beginning and 110.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 382]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 1735 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1360 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1323 IncrementalHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 375 mSDtfsCounter, 1323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=14, InterpolantAutomatonStates: 126, 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, 18 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 343 ConstructedInterpolants, 19 QuantifiedInterpolants, 3147 SizeOfPredicates, 22 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 11/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 00:22:58,870 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 Result: TRUE