./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:34:55,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:34:55,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:34:55,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:34:55,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:34:55,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:34:55,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:34:55,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:34:55,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:34:55,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:34:55,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:34:55,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:34:55,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:34:55,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:34:55,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:34:55,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:34:55,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:34:55,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:34:55,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:34:55,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:34:55,448 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:34:55,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:34:55,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:34:55,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:34:55,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:34:55,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:34:55,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:34:55,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:34:55,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:34:55,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:34:55,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:34:55,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:34:55,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:34:55,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:34:55,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:34:55,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:34:55,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:34:55,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:34:55,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:34:55,454 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 -> 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 [2024-11-19 06:34:55,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:34:55,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:34:55,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:34:55,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:34:55,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:34:55,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2024-11-19 06:34:57,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:34:57,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:34:57,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2024-11-19 06:34:57,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf8d81a3/f650f90d89ef46bd91dd421947d1ab63/FLAGf28367ad0 [2024-11-19 06:34:57,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf8d81a3/f650f90d89ef46bd91dd421947d1ab63 [2024-11-19 06:34:57,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:34:57,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:34:57,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:34:57,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:34:57,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:34:57,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5c784e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57, skipping insertion in model container [2024-11-19 06:34:57,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:34:57,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:34:57,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:34:57,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:34:57,851 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:34:57,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57 WrapperNode [2024-11-19 06:34:57,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:34:57,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:34:57,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:34:57,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:34:57,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,894 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-19 06:34:57,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:34:57,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:34:57,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:34:57,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:34:57,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,935 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [4, 4, 4, 3, 2]. 24 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 9 writes are split as follows [2, 2, 2, 2, 1]. [2024-11-19 06:34:57,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:34:57,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:34:57,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:34:57,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:34:57,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (1/1) ... [2024-11-19 06:34:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:34:57,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:57,994 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-19 06:34:57,997 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-19 06:34:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:34:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:34:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:34:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 06:34:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 06:34:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:34:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:34:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:34:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 06:34:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 06:34:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:34:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:34:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:34:58,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:34:58,161 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:34:58,163 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:34:58,417 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 06:34:58,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:34:58,438 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:34:58,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:34:58,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:34:58 BoogieIcfgContainer [2024-11-19 06:34:58,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:34:58,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:34:58,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:34:58,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:34:58,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:34:57" (1/3) ... [2024-11-19 06:34:58,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c58cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:34:58, skipping insertion in model container [2024-11-19 06:34:58,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:34:57" (2/3) ... [2024-11-19 06:34:58,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c58cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:34:58, skipping insertion in model container [2024-11-19 06:34:58,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:34:58" (3/3) ... [2024-11-19 06:34:58,449 INFO L112 eAbstractionObserver]: Analyzing ICFG c.07-alloca.i [2024-11-19 06:34:58,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:34:58,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-19 06:34:58,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:34:58,522 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;@34fdd82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:34:58,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-19 06:34:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:34:58,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:58,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:34:58,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:34:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-19 06:34:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108609108] [2024-11-19 06:34:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:59,080 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-19 06:34:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108609108] [2024-11-19 06:34:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108609108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:59,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:34:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275086394] [2024-11-19 06:34:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:59,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:34:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:34:59,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:34:59,183 INFO L87 Difference]: Start difference. First operand has 70 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:59,281 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-11-19 06:34:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:34:59,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:34:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:59,289 INFO L225 Difference]: With dead ends: 66 [2024-11-19 06:34:59,290 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 06:34:59,291 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-19 06:34:59,295 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:59,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 06:34:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 06:34:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 33 states have (on average 2.0) internal successors, (66), 63 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-19 06:34:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2024-11-19 06:34:59,332 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 3 [2024-11-19 06:34:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:59,333 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-11-19 06:34:59,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2024-11-19 06:34:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:34:59,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:59,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:34:59,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:34:59,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:34:59,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-19 06:34:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:59,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851969203] [2024-11-19 06:34:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:59,556 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-19 06:34:59,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:59,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851969203] [2024-11-19 06:34:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851969203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:34:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769428760] [2024-11-19 06:34:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:59,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:34:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:34:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:34:59,562 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:59,629 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-19 06:34:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:34:59,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:34:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:59,630 INFO L225 Difference]: With dead ends: 60 [2024-11-19 06:34:59,631 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 06:34:59,631 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-19 06:34:59,632 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:59,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 06:34:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-19 06:34:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.878787878787879) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-11-19 06:34:59,641 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 3 [2024-11-19 06:34:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:59,642 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-11-19 06:34:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2024-11-19 06:34:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:34:59,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:59,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:34:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:34:59,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:34:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-19 06:34:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525158786] [2024-11-19 06:34:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:59,747 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-19 06:34:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525158786] [2024-11-19 06:34:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525158786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:59,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:34:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230548293] [2024-11-19 06:34:59,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:34:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:34:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:34:59,752 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:59,814 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-19 06:34:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:34:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:34:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:59,816 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:34:59,816 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:34:59,816 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-19 06:34:59,817 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:59,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:34:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 06:34:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 55 states have internal predecessors, (58), 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-19 06:34:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-19 06:34:59,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 4 [2024-11-19 06:34:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-19 06:34:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-19 06:34:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:34:59,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:59,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:34:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:34:59,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:34:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-19 06:34:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:59,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514308961] [2024-11-19 06:34:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,008 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-19 06:35:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514308961] [2024-11-19 06:35:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514308961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727663656] [2024-11-19 06:35:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,011 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,057 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-19 06:35:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:35:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,058 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:35:00,058 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:35:00,058 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-19 06:35:00,059 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:35:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 06:35:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 51 states have internal predecessors, (54), 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-19 06:35:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-11-19 06:35:00,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 4 [2024-11-19 06:35:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,064 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-11-19 06:35:00,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-11-19 06:35:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:35:00,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:35:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:35:00,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-19 06:35:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733220396] [2024-11-19 06:35:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,131 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-19 06:35:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733220396] [2024-11-19 06:35:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733220396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620872847] [2024-11-19 06:35:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,134 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,182 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-19 06:35:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:35:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,183 INFO L225 Difference]: With dead ends: 48 [2024-11-19 06:35:00,183 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 06:35:00,184 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-19 06:35:00,185 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 06:35:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 06:35:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 47 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-19 06:35:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-19 06:35:00,192 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 5 [2024-11-19 06:35:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,194 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-19 06:35:00,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 06:35:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-19 06:35:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:35:00,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:35:00,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:35:00,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-19 06:35:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515977389] [2024-11-19 06:35:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,315 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-19 06:35:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515977389] [2024-11-19 06:35:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515977389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786067769] [2024-11-19 06:35:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,320 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,359 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-11-19 06:35:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:35:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,360 INFO L225 Difference]: With dead ends: 44 [2024-11-19 06:35:00,361 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 06:35:00,362 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-19 06:35:00,363 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 06:35:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 06:35:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.393939393939394) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-11-19 06:35:00,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 5 [2024-11-19 06:35:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-11-19 06:35:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 06:35:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-11-19 06:35:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:35:00,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:35:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:35:00,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2024-11-19 06:35:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404062088] [2024-11-19 06:35:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,436 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-19 06:35:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404062088] [2024-11-19 06:35:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404062088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345340403] [2024-11-19 06:35:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,439 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,489 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-19 06:35:00,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,490 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-19 06:35:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,491 INFO L225 Difference]: With dead ends: 41 [2024-11-19 06:35:00,491 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 06:35:00,491 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-19 06:35:00,492 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 06:35:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-19 06:35:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.303030303030303) internal successors, (43), 40 states have internal predecessors, (43), 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-19 06:35:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-19 06:35:00,498 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 6 [2024-11-19 06:35:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-19 06:35:00,499 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-19 06:35:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-19 06:35:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:35:00,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:35:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:35:00,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2024-11-19 06:35:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419216878] [2024-11-19 06:35:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,632 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-19 06:35:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419216878] [2024-11-19 06:35:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419216878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701939639] [2024-11-19 06:35:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,635 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,670 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-19 06:35:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,670 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-19 06:35:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,671 INFO L225 Difference]: With dead ends: 38 [2024-11-19 06:35:00,672 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 06:35:00,672 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-19 06:35:00,674 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 06:35:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 06:35:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 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-19 06:35:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-11-19 06:35:00,680 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 6 [2024-11-19 06:35:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-11-19 06:35:00,680 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-19 06:35:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-19 06:35:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:35:00,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:35:00,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:35:00,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026983, now seen corresponding path program 1 times [2024-11-19 06:35:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613582207] [2024-11-19 06:35:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,736 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-19 06:35:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613582207] [2024-11-19 06:35:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613582207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396125668] [2024-11-19 06:35:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,741 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,777 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-19 06:35:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:35:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,780 INFO L225 Difference]: With dead ends: 36 [2024-11-19 06:35:00,780 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 06:35:00,780 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-19 06:35:00,781 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 06:35:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 06:35:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 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-19 06:35:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-19 06:35:00,787 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 7 [2024-11-19 06:35:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-19 06:35:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-19 06:35:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-19 06:35:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:35:00,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:35:00,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:35:00,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026984, now seen corresponding path program 1 times [2024-11-19 06:35:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128341061] [2024-11-19 06:35:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:00,863 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-19 06:35:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128341061] [2024-11-19 06:35:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128341061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:35:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238216334] [2024-11-19 06:35:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:35:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:35:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:35:00,865 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:00,897 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-19 06:35:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:35:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:35:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:00,898 INFO L225 Difference]: With dead ends: 34 [2024-11-19 06:35:00,898 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 06:35:00,898 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-19 06:35:00,899 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:00,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 06:35:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 06:35:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-11-19 06:35:00,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 7 [2024-11-19 06:35:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:00,904 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-11-19 06:35:00,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-19 06:35:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-11-19 06:35:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:35:00,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:35:00,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:35:00,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:35:00,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-19 06:35:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:35:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1572503924, now seen corresponding path program 1 times [2024-11-19 06:35:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:35:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671834353] [2024-11-19 06:35:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:35:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:35:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:35:01,419 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-19 06:35:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:35:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671834353] [2024-11-19 06:35:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671834353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:35:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:35:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:35:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580699059] [2024-11-19 06:35:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:35:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:35:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:35:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:35:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:35:01,421 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:35:01,466 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-19 06:35:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:35:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:35:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:35:01,468 INFO L225 Difference]: With dead ends: 33 [2024-11-19 06:35:01,468 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:35:01,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:35:01,469 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:35:01,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:35:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:35:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:35:01,470 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-19 06:35:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:35:01,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-19 06:35:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:35:01,470 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:35:01,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:35:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:35:01,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:35:01,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 35 remaining) [2024-11-19 06:35:01,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2024-11-19 06:35:01,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2024-11-19 06:35:01,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2024-11-19 06:35:01,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2024-11-19 06:35:01,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2024-11-19 06:35:01,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2024-11-19 06:35:01,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2024-11-19 06:35:01,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2024-11-19 06:35:01,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2024-11-19 06:35:01,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2024-11-19 06:35:01,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2024-11-19 06:35:01,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2024-11-19 06:35:01,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2024-11-19 06:35:01,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2024-11-19 06:35:01,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2024-11-19 06:35:01,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2024-11-19 06:35:01,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2024-11-19 06:35:01,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2024-11-19 06:35:01,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2024-11-19 06:35:01,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2024-11-19 06:35:01,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2024-11-19 06:35:01,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2024-11-19 06:35:01,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2024-11-19 06:35:01,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2024-11-19 06:35:01,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2024-11-19 06:35:01,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2024-11-19 06:35:01,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2024-11-19 06:35:01,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2024-11-19 06:35:01,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2024-11-19 06:35:01,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2024-11-19 06:35:01,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 35 remaining) [2024-11-19 06:35:01,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 35 remaining) [2024-11-19 06:35:01,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 35 remaining) [2024-11-19 06:35:01,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2024-11-19 06:35:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:35:01,488 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:35:01,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:35:01,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:35:01 BoogieIcfgContainer [2024-11-19 06:35:01,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:35:01,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:35:01,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:35:01,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:35:01,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:34:58" (3/4) ... [2024-11-19 06:35:01,499 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:35:01,510 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 06:35:01,511 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:35:01,511 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 06:35:01,511 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:35:01,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:35:01,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:35:01,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:35:01,605 INFO L158 Benchmark]: Toolchain (without parser) took 4215.79ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 132.1MB in the beginning and 57.3MB in the end (delta: 74.7MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,606 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:35:01,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.02ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 113.4MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.34ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 112.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:35:01,607 INFO L158 Benchmark]: Boogie Preprocessor took 57.13ms. Allocated memory is still 165.7MB. Free memory was 112.3MB in the beginning and 109.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,607 INFO L158 Benchmark]: RCFGBuilder took 486.51ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 89.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,608 INFO L158 Benchmark]: TraceAbstraction took 3054.14ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 88.2MB in the beginning and 62.6MB in the end (delta: 25.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,608 INFO L158 Benchmark]: Witness Printer took 108.53ms. Allocated memory is still 201.3MB. Free memory was 62.6MB in the beginning and 57.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 06:35:01,610 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.21ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.02ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 113.4MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.34ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 112.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.13ms. Allocated memory is still 165.7MB. Free memory was 112.3MB in the beginning and 109.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 486.51ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 89.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3054.14ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 88.2MB in the beginning and 62.6MB in the end (delta: 25.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 108.53ms. Allocated memory is still 201.3MB. Free memory was 62.6MB in the beginning and 57.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 334 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 263 mSDtfsCounter, 334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 34, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:35:01,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE