./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:58,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:58,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2023-11-06 22:47:58,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:58,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:58,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:58,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:58,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:58,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:58,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:58,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:58,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:58,950 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:58,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:58,952 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:58,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:58,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:58,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:58,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:58,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:58,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:58,956 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:58,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:58,957 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:58,957 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:58,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:58,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:58,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:58,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:58,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:58,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:58,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:58,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:58,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:58,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:58,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:58,963 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:58,963 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 [2023-11-06 22:47:59,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:59,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:59,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:59,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:59,310 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:59,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/forester-heap/dll-optional-2.i [2023-11-06 22:48:02,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:02,633 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:02,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/sv-benchmarks/c/forester-heap/dll-optional-2.i [2023-11-06 22:48:02,649 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/data/cb673a795/fbfc205cd12548c381304929632cae68/FLAG86c0bfdcb [2023-11-06 22:48:02,664 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/data/cb673a795/fbfc205cd12548c381304929632cae68 [2023-11-06 22:48:02,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:02,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:02,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:02,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:02,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:02,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f3a1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:02, skipping insertion in model container [2023-11-06 22:48:02,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:02" (1/1) ... [2023-11-06 22:48:02,730 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:03,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:03,135 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:03,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:03,206 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:03,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03 WrapperNode [2023-11-06 22:48:03,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:03,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:03,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:03,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:03,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,258 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 128 [2023-11-06 22:48:03,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:03,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:03,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:03,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:03,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:03,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:03,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:03,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:03,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (1/1) ... [2023-11-06 22:48:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:03,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:48:03,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:48:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:48:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:48:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:48:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:48:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:48:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:48:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:03,559 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:03,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:04,060 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:04,067 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:04,075 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:48:04,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:04 BoogieIcfgContainer [2023-11-06 22:48:04,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:04,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:04,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:04,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:04,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:02" (1/3) ... [2023-11-06 22:48:04,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c251b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:04, skipping insertion in model container [2023-11-06 22:48:04,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:03" (2/3) ... [2023-11-06 22:48:04,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c251b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:04, skipping insertion in model container [2023-11-06 22:48:04,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:04" (3/3) ... [2023-11-06 22:48:04,088 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2023-11-06 22:48:04,108 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:04,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2023-11-06 22:48:04,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:04,172 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@f90df08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:04,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-11-06 22:48:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 139 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:48:04,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:04,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:48:04,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:04,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:48:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859166701] [2023-11-06 22:48:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859166701] [2023-11-06 22:48:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859166701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356542416] [2023-11-06 22:48:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:04,424 INFO L87 Difference]: Start difference. First operand has 140 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 139 states have internal predecessors, (155), 0 states have call successors, (0), 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) [2023-11-06 22:48:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:04,598 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-11-06 22:48:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:04,612 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 [2023-11-06 22:48:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:04,622 INFO L225 Difference]: With dead ends: 138 [2023-11-06 22:48:04,622 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:48:04,624 INFO L412 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 [2023-11-06 22:48:04,628 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:04,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 77 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:48:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:48:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2023-11-06 22:48:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.8918918918918919) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2023-11-06 22:48:04,700 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 3 [2023-11-06 22:48:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:04,701 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2023-11-06 22:48:04,701 INFO L496 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) [2023-11-06 22:48:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2023-11-06 22:48:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:48:04,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:04,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:48:04,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:48:04,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:04,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:48:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682527125] [2023-11-06 22:48:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682527125] [2023-11-06 22:48:04,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682527125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:04,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645080874] [2023-11-06 22:48:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:04,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:04,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:04,810 INFO L87 Difference]: Start difference. First operand 130 states and 140 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) [2023-11-06 22:48:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:04,980 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-11-06 22:48:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:04,982 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 [2023-11-06 22:48:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:04,989 INFO L225 Difference]: With dead ends: 125 [2023-11-06 22:48:04,989 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 22:48:04,990 INFO L412 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 [2023-11-06 22:48:04,993 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:04,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 90 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:48:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 22:48:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2023-11-06 22:48:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7702702702702702) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2023-11-06 22:48:05,021 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 3 [2023-11-06 22:48:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:05,022 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2023-11-06 22:48:05,022 INFO L496 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) [2023-11-06 22:48:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2023-11-06 22:48:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:48:05,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:05,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:05,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:48:05,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:05,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2023-11-06 22:48:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022843397] [2023-11-06 22:48:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:05,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022843397] [2023-11-06 22:48:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022843397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027432089] [2023-11-06 22:48:05,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:05,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:05,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:05,381 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:05,621 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2023-11-06 22:48:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:05,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-06 22:48:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:05,624 INFO L225 Difference]: With dead ends: 151 [2023-11-06 22:48:05,624 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:48:05,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:05,632 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 36 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:05,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 290 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:48:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2023-11-06 22:48:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2023-11-06 22:48:05,650 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 12 [2023-11-06 22:48:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:05,650 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2023-11-06 22:48:05,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2023-11-06 22:48:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:48:05,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:05,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:05,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:48:05,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:05,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2023-11-06 22:48:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594838548] [2023-11-06 22:48:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:06,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594838548] [2023-11-06 22:48:06,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594838548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:06,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:06,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914021306] [2023-11-06 22:48:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:06,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:06,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:06,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:06,047 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:06,301 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-11-06 22:48:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-06 22:48:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:06,302 INFO L225 Difference]: With dead ends: 119 [2023-11-06 22:48:06,303 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 22:48:06,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:06,304 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:06,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 320 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 22:48:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-06 22:48:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 74 states have (on average 1.7432432432432432) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2023-11-06 22:48:06,320 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 12 [2023-11-06 22:48:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:06,321 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2023-11-06 22:48:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2023-11-06 22:48:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:48:06,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:06,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:06,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:48:06,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:06,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2023-11-06 22:48:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882149835] [2023-11-06 22:48:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882149835] [2023-11-06 22:48:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882149835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840969460] [2023-11-06 22:48:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:06,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:06,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:06,509 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:06,701 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-11-06 22:48:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 22:48:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:06,703 INFO L225 Difference]: With dead ends: 122 [2023-11-06 22:48:06,703 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:48:06,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:06,706 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:06,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 68 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:48:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2023-11-06 22:48:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.6) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2023-11-06 22:48:06,728 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 13 [2023-11-06 22:48:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:06,728 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2023-11-06 22:48:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2023-11-06 22:48:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:48:06,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:06,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:06,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:48:06,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:06,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2023-11-06 22:48:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330183863] [2023-11-06 22:48:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330183863] [2023-11-06 22:48:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330183863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:06,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863675706] [2023-11-06 22:48:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:06,916 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:07,135 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2023-11-06 22:48:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:07,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 22:48:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:07,137 INFO L225 Difference]: With dead ends: 160 [2023-11-06 22:48:07,137 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 22:48:07,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:07,139 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 152 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:07,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 104 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 22:48:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2023-11-06 22:48:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 134 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2023-11-06 22:48:07,153 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 13 [2023-11-06 22:48:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:07,155 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2023-11-06 22:48:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2023-11-06 22:48:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:48:07,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:07,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:07,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:48:07,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:07,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2023-11-06 22:48:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:07,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493935123] [2023-11-06 22:48:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493935123] [2023-11-06 22:48:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493935123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630550910] [2023-11-06 22:48:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:07,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:07,342 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:07,510 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2023-11-06 22:48:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:48:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:07,517 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:48:07,517 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:48:07,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:07,521 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:07,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 267 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:48:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:48:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-06 22:48:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2023-11-06 22:48:07,529 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 16 [2023-11-06 22:48:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:07,529 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2023-11-06 22:48:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2023-11-06 22:48:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:48:07,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:07,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:07,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:48:07,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:07,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2023-11-06 22:48:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5322533] [2023-11-06 22:48:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5322533] [2023-11-06 22:48:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5322533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638487358] [2023-11-06 22:48:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:07,752 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:07,946 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2023-11-06 22:48:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:07,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:48:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:07,948 INFO L225 Difference]: With dead ends: 133 [2023-11-06 22:48:07,948 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 22:48:07,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:07,949 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:07,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 22:48:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-06 22:48:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 132 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2023-11-06 22:48:07,953 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 16 [2023-11-06 22:48:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:07,954 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2023-11-06 22:48:07,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2023-11-06 22:48:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:48:07,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:07,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:07,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:48:07,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:07,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1503809114, now seen corresponding path program 1 times [2023-11-06 22:48:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532076449] [2023-11-06 22:48:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:08,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:08,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532076449] [2023-11-06 22:48:08,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532076449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:08,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:08,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443151983] [2023-11-06 22:48:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:08,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:08,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:08,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:08,004 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:08,139 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2023-11-06 22:48:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:08,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 22:48:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:08,141 INFO L225 Difference]: With dead ends: 151 [2023-11-06 22:48:08,141 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:48:08,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:08,142 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 138 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:08,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 148 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:48:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:48:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2023-11-06 22:48:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2023-11-06 22:48:08,147 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 18 [2023-11-06 22:48:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:08,147 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2023-11-06 22:48:08,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2023-11-06 22:48:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:48:08,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:08,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:08,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:48:08,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-11-06 22:48:08,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1745079141, now seen corresponding path program 1 times [2023-11-06 22:48:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252287392] [2023-11-06 22:48:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:08,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:08,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:48:08,245 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:08,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2023-11-06 22:48:08,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2023-11-06 22:48:08,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2023-11-06 22:48:08,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2023-11-06 22:48:08,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2023-11-06 22:48:08,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2023-11-06 22:48:08,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2023-11-06 22:48:08,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2023-11-06 22:48:08,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2023-11-06 22:48:08,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2023-11-06 22:48:08,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2023-11-06 22:48:08,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2023-11-06 22:48:08,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2023-11-06 22:48:08,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2023-11-06 22:48:08,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2023-11-06 22:48:08,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2023-11-06 22:48:08,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2023-11-06 22:48:08,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2023-11-06 22:48:08,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2023-11-06 22:48:08,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2023-11-06 22:48:08,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2023-11-06 22:48:08,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2023-11-06 22:48:08,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2023-11-06 22:48:08,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2023-11-06 22:48:08,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2023-11-06 22:48:08,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2023-11-06 22:48:08,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2023-11-06 22:48:08,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2023-11-06 22:48:08,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2023-11-06 22:48:08,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2023-11-06 22:48:08,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2023-11-06 22:48:08,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2023-11-06 22:48:08,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2023-11-06 22:48:08,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2023-11-06 22:48:08,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2023-11-06 22:48:08,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2023-11-06 22:48:08,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2023-11-06 22:48:08,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2023-11-06 22:48:08,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 66 remaining) [2023-11-06 22:48:08,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 66 remaining) [2023-11-06 22:48:08,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 66 remaining) [2023-11-06 22:48:08,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 66 remaining) [2023-11-06 22:48:08,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2023-11-06 22:48:08,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2023-11-06 22:48:08,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2023-11-06 22:48:08,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2023-11-06 22:48:08,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2023-11-06 22:48:08,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2023-11-06 22:48:08,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2023-11-06 22:48:08,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2023-11-06 22:48:08,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2023-11-06 22:48:08,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2023-11-06 22:48:08,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2023-11-06 22:48:08,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2023-11-06 22:48:08,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2023-11-06 22:48:08,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2023-11-06 22:48:08,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2023-11-06 22:48:08,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 66 remaining) [2023-11-06 22:48:08,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2023-11-06 22:48:08,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (6 of 66 remaining) [2023-11-06 22:48:08,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (5 of 66 remaining) [2023-11-06 22:48:08,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (4 of 66 remaining) [2023-11-06 22:48:08,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (3 of 66 remaining) [2023-11-06 22:48:08,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (2 of 66 remaining) [2023-11-06 22:48:08,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (1 of 66 remaining) [2023-11-06 22:48:08,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (0 of 66 remaining) [2023-11-06 22:48:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:48:08,269 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:08,274 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:08,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:08 BoogieIcfgContainer [2023-11-06 22:48:08,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:08,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:08,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:08,303 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:08,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:04" (3/4) ... [2023-11-06 22:48:08,305 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:48:08,362 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:48:08,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:08,363 INFO L158 Benchmark]: Toolchain (without parser) took 5694.76ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 143.1MB in the beginning and 180.1MB in the end (delta: -37.0MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,364 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 146.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:08,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.98ms. Allocated memory is still 188.7MB. Free memory was 143.1MB in the beginning and 125.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 188.7MB. Free memory was 125.0MB in the beginning and 123.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,365 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,365 INFO L158 Benchmark]: RCFGBuilder took 781.87ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 95.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,366 INFO L158 Benchmark]: TraceAbstraction took 4220.99ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 95.0MB in the beginning and 182.2MB in the end (delta: -87.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:08,366 INFO L158 Benchmark]: Witness Printer took 59.99ms. Allocated memory is still 226.5MB. Free memory was 182.2MB in the beginning and 180.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:08,369 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.31ms. Allocated memory is still 146.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.98ms. Allocated memory is still 188.7MB. Free memory was 143.1MB in the beginning and 125.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 188.7MB. Free memory was 125.0MB in the beginning and 123.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 781.87ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 95.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4220.99ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 95.0MB in the beginning and 182.2MB in the end (delta: -87.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.99ms. Allocated memory is still 226.5MB. Free memory was 182.2MB in the beginning and 180.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 VAL [head={-1:0}] [L1000] head->opt = head VAL [head={-1:0}] [L1001] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head VAL [head={-1:0}, x={-1:0}] [L1007] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1009] EXPR x->data VAL [head={-1:0}, x->data=1, x={-1:0}] [L1009] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x->data == 2 && x->opt == x=0, x->data=1, x={-1:0}] [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "dll-optional-2.c", 16, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 718 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 1626 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 863 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 763 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:48:08,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c0756fa-c3f1-4c47-ae69-0235e5872fcd/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)